Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications
نویسندگان
چکیده
In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivity between a pair of nodes is defined as the number of contacts taking place over a finite time window. The connectivity matrix is then used to evaluate the eigenvector centrality of the various nodes. Numerical results from real-world traces are presented and discussed. The applicability of the proposed approach to select on-line message forwarders is also addressed.
منابع مشابه
A note on a generalization of eigenvector centrality for bipartite graphs and applications
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector centrality invariant is defined which is motivated by the need to design rating systems for bipartite graph models of time-sensitive and other processes. The linear algebra connection and some applications are described.
متن کاملCorrelation of Eigenvector Centrality to Other Centrality Measures: Random, Small-world and Real-world Networks
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...
متن کاملExploring Temporal Communication Through Social Networks
The dissemination of information in social networks and the relative effect of ICT (Information and Communications Technology) use has long been an interesting area of study in the field of sociology, human computer interaction and computer supported cooperative work. To date, a lot of research has been conducted regarding an actor’s mobile phone usage behavior while disseminating information w...
متن کاملCorrelations between Centrality Measures for Mobile Ad hoc Networks
The author conducts an extensive correlation coefficient analysis of four prominent centrality measures for mobile ad hoc networks. The centrality measures considered are the degree-based degree centrality and eigenvector centrality, and the shortest path-based betweenness centrality and closeness centrality. The author evaluates the correlation coefficient between any two of the above four cen...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کامل